FastGeodis: Fast Generalised Geodesic Distance Transform
نویسندگان
چکیده
The FastGeodis package provides an efficient implementation for computing Geodesic and Euclidean distance transforms (or a mixture of both), targeting utilisation CPU GPU hardware. In particular, it implements the paralellisable raster scan method from Criminisi et al. (2009), where elements in row (2D) or plane (3D) can be computed with parallel threads. This is able to handle 2D as well 3D data, achieves up 20x speedup on 74x compared existing open-source library (Wang, 2020) that uses non-parallelisable single-thread implementation. performance speedups reported here were evaluated using volume data Nvidia GeForce Titan X (12 GB) 6-Core Intel Xeon E5-1650 CPU. Further in-depth comparison improvements are discussed documentation: https://fastgeodis.readthedocs.io
منابع مشابه
Fast and accurate geodesic distance transform by ordered propagation
In this paper we present a new geodesic distance transform that uses a non Euclidean metric suitable for non convex discrete 2D domains. The geodesic metric used is defined as the shortest path length through a set of pixels called Locally Nearest Hidden Pixels, and manages visibility zones using bounding angles. The algorithm is designed using ordered propagation, which makes it extremely effi...
متن کاملFast geodesic distance approximation using mesh decimation and front propagation
Polygon meshes are collections of vertices, edges and faces defining surfaces in a 3D environment. Computing geometric features on a polygon mesh is of major interest for various applications. Among these features, the geodesic distance is the distance between two vertices following the surface defined by the mesh. In this paper, we propose an algorithm for fast geodesic distance approximation ...
متن کاملApproximating geodesic tree distance
Billera, Holmes, and Vogtmann introduced an intriguing new phylogenetic tree metric for weighted trees with useful properties related to statistical analysis. However, the best known algorithm for calculating this distance is exponential in the number of leaves of the trees compared. We point out that lower and upper bounds for this distance, which can be calculated in linear time, can differ b...
متن کاملFast Geodesic Active
| We use an unconditionally stable numerical scheme to implement a fast version of the geodesic active contour model. The proposed scheme is useful for object segmentation in images, like tracking moving objects in a sequence of images. The method is based on the Weickert-Romeney-Viergever AOS scheme. It is applied at small regions , motivated by Adalsteinsson-Sethian level set narrow band appr...
متن کاملFast Geodesic Active Contours
We use an unconditionally stable numerical scheme to implement a fast version of the geodesic active contour model. The proposed scheme is useful for object segmentation in images, like tracking moving objects in a sequence of images. The method is based on the Weickert-Romeney-Viergever (additive operator splitting) AOS scheme. It is applied at small regions, motivated by the Adalsteinsson-Set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of open source software
سال: 2022
ISSN: ['2475-9066']
DOI: https://doi.org/10.21105/joss.04532